for i in range(int(input())):
x,v,l=map(int,input().split())
while x>20 and v>0 :
x=(x//2)+10
v-=1
x-=(l*10)
if x>0:
print("NO")
else:
print("YES")#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back;
#define mod 1000000007
// SUBMITTED BY PARVEJ AALAM 7077
ll fact(ll n)
{
if(n==1||n==0)
return 1;
else{
return n*fact(n-1)%mod;
}
}
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll h,m,n;
cin>>h>>n>>m;
while(h>0&&n>0&&h/2+10<h){
n--;
h=h/2+10;
}
if(h<=m*10){
cout<<"YES" <<endl;
}
else{
cout<<"NO"<<endl;
}
}
return 0;
}492A - Vanya and Cubes | 217A - Ice Skating |
270A - Fancy Fence | 181A - Series of Crimes |
1638A - Reverse | 1654C - Alice and the Cake |
369A - Valera and Plates | 1626A - Equidistant Letters |
977D - Divide by three multiply by two | 1654B - Prefix Removals |
1654A - Maximum Cake Tastiness | 1649A - Game |
139A - Petr and Book | 1612A - Distance |
520A - Pangram | 124A - The number of positions |
1041A - Heist | 901A - Hashing Trees |
1283A - Minutes Before the New Year | 1654D - Potion Brewing Class |
1107B - Digital root | 25A - IQ test |
785A - Anton and Polyhedrons | 1542B - Plus and Multiply |
306A - Candies | 1651C - Fault-tolerant Network |
870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |